Delay-Universal Channel Coding With Feedback
نویسندگان
چکیده
منابع مشابه
Universal Zero-Delay Joint Source-Channel Coding
We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. Using this scheme, we construct a universal zero-delay joint source-channe...
متن کاملVariable-length channel coding with noisy feedback
It is known that perfect noiseless feedback can be used to improve the reliability of communication systems. We show how to make those gains robust to noise on the feedback link. We focus on feedback links that are themselves discrete memoryless channels. We demonstrate that Forney’s erasure-decoding exponent is achievable given any positive-capacity feedback channel. We also demonstrate that a...
متن کاملJoint source-channel coding with feedback (extended)
This paper quantifies the fundamental limits of variable-length transmission of a general (possibly analog) source over a memoryless channel with noiseless feedback, under a distortion constraint. We consider excess distortion, average distortion and guaranteed distortion (d-semifaithful codes). In contrast to the asymptotic fundamental limit, a general conclusion is that allowing variable-leng...
متن کاملWhy delay and block length are not the same thing for channel coding with feedback
Classically, information theorists have understood the tradeoff between delay and system error performance by using block-length as a proxy. Although this turns out to be correct when feedback is absent, it is shown to be very misleading when feedback is available. For symmetric channels, fixed blocklength communication systems show no improvements in their error exponents while fixed delay sys...
متن کاملVariable-Rate Coding with Feedback for Universal Communication Systems
Classical coding schemes that rely on joint typicality (such as Slepian-Wolf coding and channel coding) assume known statistics and rely on asymptotically long sequences. However, in practice the statistics are unknown, and the sequences are of finite length n. In this finite regime, we must allow a non-zero probability of coding error and also pay a penalty by transmitting extra bits. The pena...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2853140